A Randomization Method for Quasi Maximum Likelihood Decoding
نویسندگان
چکیده
In Multiple-Input Multiple-Output (MIMO) systems, Maximum-Likelihood (ML) decoding is equivalent to £nding the closest lattice point in an N dimensional complex space. In [1], we have proposed several quasimaximum likelihood relaxation models for decoding in MIMO systems based on semi-de£nite programming. In this paper, we propose randomization algorithms that £nd a near-optimum solution of the decoding problem by exploring the solution of the corresponding semi-de£nite relaxations.
منابع مشابه
Optimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کاملAsymptotic Diversity Analysis of Alamouti Transmit Diversity with Quasi-ML Decoding Algorithm in Time-Selective Fading Channels
This paper addresses the asymptotic diversity performance of Alamouti transmit diversity technique especially in time-selective fading channels. In particular, a linear quasi-maximum-likelihood (QML) decoding method is employed for the Alamouti transmit diversity system to solve the error floor problem induced by the conventional linear ML decoding method. By judiciously utilizing the derived a...
متن کاملNew Set of Codes for the Maximum-Likelihood Decoding Problem
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is, codes that can be decoded through a polynomial time algorithm A whose decoding bound is beyond the covering radius. For these codes, we show that the maximum-likelihood decoding problem is reachable in polynomial tim...
متن کاملAn Efficient Quasi-Maximum Likelihood Decoding for Finite Constellations
In Multi-Input Multi-Output (MIMO) systems, maximum-likelihood (ML) decoding is equivalent to finding the closest lattice point in an N -dimensional complex space. In general, this algorithm is known to be NP hard. In this paper, we propose a quasi-maximum likelihood algorithm based on Semi-Definite Programming (SDP). We introduce several SDP relaxation models for MIMO systems, with increasing ...
متن کاملA Bayesian Nominal Regression Model with Random Effects for Analysing Tehran Labor Force Survey Data
Large survey data are often accompanied by sampling weights that reflect the inequality probabilities for selecting samples in complex sampling. Sampling weights act as an expansion factor that, by scaling the subjects, turns the sample into a representative of the community. The quasi-maximum likelihood method is one of the approaches for considering sampling weights in the frequentist framewo...
متن کامل